package l.l.w.practice.操作序列;

import java.util.*;

/**
 * Created by llw on 2017/10/8.
 */
public class 操作序列 {

    public Integer[] operation(int n,int[] nums){
        LinkedList<Integer> list = new LinkedList<>();
        for(int i = 0; i < n; ++i){
            if((i & 1)==0){//偶数
                list.add(nums[i]);
            }else{
                list.addFirst(nums[i]);
            }
        }
        Integer[] result =new Integer[n];
        if((n & 1) ==1){
            for(int i = n-1; i>=0; --i){
                result[n-1-i] = list.get(i);
            }
        }else{
            result = list.toArray(result);
        }
        return result;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; ++i){
            nums[i] = scanner.nextInt();
        }
        Integer[] result = new 操作序列().operation(n,nums);
        for(int i = 0; i < n-1; ++i)
            System.out.print(result[i].intValue() + " ");
        System.out.print(result[n-1].intValue()+"\n");
    }
}
